Fuzzy DLs over Finite Lattices with Nominals
نویسنده
چکیده
The complexity of reasoning in fuzzy description logics (DLs) over a finite lattice L usually does not exceed that of the underlying classical DLs. This has recently been shown for the logics between L-IALC and L-ISCHI using a combination of automataand tableau-based techniques. In this paper, this approach is modified to deal with nominals and constants in L-ISCHOI. Reasoning w.r.t. general TBoxes is ExpTimecomplete, and PSpace-completeness is shown under the restriction to acyclic terminologies in two sublogics. The latter implies two previously unknown complexity results for the classical DLs ALCHO and SO.
منابع مشابه
The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals
The complexity of reasoning in fuzzy description logics (DLs) over finite lattices usually does not exceed that of the underlying classical DLs. This has recently been shown for the logics between L-IALC and L-ISCHI using a combination of automataand tableau-based techniques. In this report, this approach is modified to deal with nominals and constants in L-ISCHOI. Reasoning w.r.t. general TBox...
متن کاملFuzzy Ontologies over Lattices with T-norms
In some knowledge domains, a correct handling of vagueness and imprecision is fundamental for adequate knowledge representation and reasoning. For example, when trying to diagnose a disease, medical experts need to confront symptoms described by the patient, which are by definition subjective, and hence vague. Moreover, a single malady may present a diversity of clinical manifestations in diffe...
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملFinite Fuzzy Description Logics: A Crisp Representation for Finite Fuzzy ALCH
Fuzzy Description Logics (DLs) are a formalism for the representation of structured knowledge affected by imprecision or vagueness. In the setting of fuzzy DLs, restricting to a finite set of degrees of truth has proved to be useful. In this paper, we propose finite fuzzy DLs as a generalization of existing approaches. We assume a finite totally ordered set of linguistic terms or labels, which ...
متن کاملRegular Path Queries in Expressive Description Logics with Nominals
Reasoning over complex queries in the DLs underlying OWL 2 is of importance in several application domains. We provide decidability and (tight) upper bounds for the problem of checking entailment and containment of positive regular path queries under various combinations of constructs used in such expressive DLs; specifically: regular expressions and (safe) Booleans over roles, and allowing for...
متن کامل